Computer Science at Kent Compositional Detection of Zeno Behavior in Timed Automata with Deadlines
نویسنده
چکیده
We present a compositional analysis to detect Zeno behavior in Timed Automata with Deadlines. A syntactic analysis is defined, based on Tripakis’ strong non-Zenoness property, which identifies all elementary cycles where Zeno behavior may occur. This analysis is complemented by TCTL reachability properties, which characterize the occurrence Zeno behavior in potentially unsafe cycles.
منابع مشابه
Computer Science at Kent Verification of Timed Automata with Deadlines in Uppaal
Timed Automata with Deadlines (TAD) are a form of timed automata that admit a more naturalrepresentation of urgent actions, with the additional advantage of avoiding the most common form oftimelocks. We offer a compositional translation of a practically useful subset of TAD to timed safetyautomata (the well-known variant of timed automata where time progress conditions are expre...
متن کاملCase for Support Part 1: Previous Research Track Record 1.1 Rodolfo Gomez (principle Investigator) Track Record 1.2 Formal Methods at Kent
Rodolfo Gomez is currently a PhD student 1 in the Computing Laboratory at Kent. In 2000, he joined the realtime systems research group at Universidad Nacional del Sur (Argentina), where he worked until 2002 on temporal and active databases and temporal query languages. This research (in collaboration, among others, with Dr. Juan Augusto at University of Ulster and Dr. Antony Galton at Universit...
متن کاملEnhancing UPPAAL’s Explanatory Power using Static Zeno Run Analysis
This thesis discusses Zeno runs and their detection in timed automata networks. Specifically, we explore Zeno runs in the context of model checking with the tool UPPAAL. Zeno runs are transition sequences in the system that can execute arbitrarily fast, which conflicts with the real world experience where execution always takes time. Accordingly, most of the time the presence of Zeno runs in a ...
متن کاملComputer Science at Kent From LIDL to Timed Automata
LIDL− is a decidable fragment of Interval Duration Logic with Located Constraints, an expressive subset of dense-time Duration Calculus. It has been claimed that, for any LIDL− formulaD, a timed automaton can be constructed which accepts the models of D. However, the proposed construction is incomplete and has not been proved effective. In this paper, we prove the effective construction of equi...
متن کاملMeeting Deadlines Together
This paper studies safety, progress, and non-zeno properties of Communicating Timed Automata (CTAs), which are timed automata (TA) extended with unbounded communication channels, and presents a procedure to build timed global specifications from systems of CTAs. We define safety and progress properties for CTAs by extending properties studied in communicating finitestate machines to the timed s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009